Extension of matrices with Laurent polynomial entries

نویسنده

  • Zuowei Shen
چکیده

Let P and Q be nr, r n matrices with Laurent polynomial entries. Suppose that Q T (z)P (z) = I r , z 2 Cnf0g. This note provides an algorithmatic construction of two n(nr) matrices G and H with Laurent polynomial entries such that the nn matrices

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric matrices, Catalan paths, and correlations

Kenyon and Pemantle (2014) gave a formula for the entries of a square matrix in terms of connected principal and almost-principal minors. Each entry is an explicit Laurent polynomial whose terms are the weights of domino tilings of a half Aztec diamond. They conjectured an analogue of this parametrization for symmetric matrices, where the Laurent monomials are indexed by Catalan paths. In this ...

متن کامل

An Algorithm for Matrix Extension and Wavelet Construction 3

This paper gives a practical method of extending an nr matrix P (z), r n, with Laurent polynomial entries in one complex variable z, to a square matrix also with Laurent polynomial entries. If P (z) has orthonormal columns when z is restricted to the torus T, it can be extended to a paraunitary matrix. If P (z) has rank r for each z 2 T, it can be extended to a matrix with nonvanishing determin...

متن کامل

An algorithm for matrix extension and wavelet construction

This paper gives a practical method of extending an n× r matrix P (z), r ≤ n, with Laurent polynomial entries in one complex variable z, to a square matrix also with Laurent polynomial entries. If P (z) has orthonormal columns when z is restricted to the torus T, it can be extended to a paraunitary matrix. If P (z) has rank r for each z ∈ T, it can be extended to a matrix with nonvanishing dete...

متن کامل

A Matrix q-Analogue of the Parikh Map

We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represents a word over a -letter alphabet as a -dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable . We show that by appropriately embedding the -letter alphabet into the -lette...

متن کامل

Euclidean Algorithm for Extension of Symmetric Laurent Polynomial Matrix and Its Application in Construction of Multiband Symmetric Perfect Reconstruction Filter Bank

For a given pair of s-dimensional real Laurent polynomials (~a(z),~b(z)), which has a certain type of symmetry and satisfies the dual condition~b(z) T ~a(z) = 1, an s× s Laurent polynomial matrix A(z) (together with its inverse A−1(z)) is called a symmetric Laurent polynomial matrix extension of the dual pair (~a(z),~b(z)) if A(z) has similar symmetry, the inverse A−1(Z) also is a Laurent polyn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996